Revisiting variable radius circles in constructive geometric constraint solving
نویسندگان
چکیده
Variable-radius circles are common constructs in planar constraint solving and are usually not handled fully by algebraic constraint solvers. We give a complete treatment of variable-radius circles when such a circle must be determined simultaneously with placing two groups of geometric entities. The problem arises for instance in solvers using triangle decomposition to reduce the complexity of the constraint problem. This work offers a set of basic constructive methods that permits to determine variable radius circles simultaneously with placing two rigid geometric objects when geometric constraints are defined on both the circumference and center point of the constraint circle. The problem has been classified by the geometric entities in two groups, one is fixed and the other has translational and rotational movement, so that the variable radius circles satisfy the constraints on the geometric entities in these two groups. The number of solutions for each problem is also given.
منابع مشابه
Variable-radius circles of cluster merging in geometric constraints: I. Translational clusters
Variable-radius circles are common constructs in planar constraint solving and are usually not handled fully by algebraic constraint solvers. We give a complete treatment of variable-radius circles when such a circle must be determined simultaneously with placing two groups of geometric entities. The problem arises for instance in solvers using triangle decomposition to reduce the complexity of...
متن کاملHardware Assist for Constrained Circle Constructions II: Cluster Merging Problems
In geometric constraint solving, constructing circles with indeterminate radius is an important sub problem. Such constructions are both sequential, meaning that we seek a circle tangent to three known geometric entities, as well as simultaneous, when several sets of entities, among them variable-radius circles, must be determined together. In Part I of our investigation, we considered sequenti...
متن کاملHardware Assistance for Constrained Circle Constructions II: Cluster Merging Problems
In geometric constraint solving, constructing circles with indeterminate radius is an important sub problem. Such constructions are both sequential, meaning that we seek a circle tangent to three known geometric entities, as well as simultaneous, when several sets of entities, among them variable-radius circles, must be determined together. In Part I of our investigation, we considered sequenti...
متن کاملA 2D geometric constraint solver using a graph reduction method
Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...
متن کاملDynBCN A Constructive Geometric Constraint-based Dynamic Geometry System
One of the goals of the Grup d’Informàtica a l’Enginyeria of the Universitat Politècnica de Catalunya at Barcelona is to conduct research on geometric constraint solving and its applications. Here we offer to the community dynBCN, a software prototype of a dynamic geometry system based on a constructive geometric constraint solving technology. So far we are offering a jar Java file. In the near...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 21 شماره
صفحات -
تاریخ انتشار 2004